An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

Searching for Minimum Storage Regenerating Codes

Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on cod...

Functional Minimum Storage Regenerating Codes For Multi-Cloud Failure

Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes

In this paper, we revisit the problem of finding the longest systematic-length k in a linear minimum storage regenerating (MSR) code, for a given storage capacity of each node l and an arbitrary number of parity nodes r. We study it by following the geometric analysis of linear subspaces and operators. First, a simple quadratic bound is given, which implies that k = r + 2 is the largest number ...

Generalization of Rashmi-Shah-Kumar Minimum-Storage-Regenerating Codes

In this paper, we propose a generalized version of the Rashmi-Shah-Kumar Minimum-Storage-Regenerating(RSKMSR) codes based on the product-matrix framework. For any (n, k, d) such that d ≥ 2k − 2 and d ≤ n − 1, we can directly construct an (n, k, d) MSR code without constructing a larger MSR code and shortening of the larger MSR code. As a result, the size of a finite field over which the propose...